On the diameter of cayley graphs of the symmetric group
نویسندگان
چکیده
In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group Sym(n), the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for sets of generators containing a permutation fixing at least 37% of the points.
منابع مشابه
COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملCubic Cayley graphs with small diameter
In this paper we apply Pólya’s Theorem to the problem of enumerating Cayley graphs on permutation groups up to isomorphisms induced by conjugacy in the symmetric group. We report the results of a search of all three-regular Cayley graphs on permutation groups of degree at most nine for small diameter graphs. We explore several methods of constructing covering graphs of these Cayley graphs. Exam...
متن کاملOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 49 شماره
صفحات -
تاریخ انتشار 1988